Flexible Instruction-Set Semantics via Abstract Monads (Experience Report)

نویسندگان

چکیده

Instruction sets, from families like x86 and ARM, are at the center of many ambitious formal-methods projects. Many verification, synthesis, programming, debugging tools rely on formal semantics instruction but different can use in rather ways. The best-known work applying single across diverse relies domain-specific languages Sail, where language its translation specialized to realm sets. In context open RISC-V instruction-set family, we decided explore a approach, with written carefully chosen subset Haskell. This style does not depend any new translators, relying instead parameterization over type-class instances. We have used core support testing, interactive proof, model checking both software hardware, demonstrating that monads ability abstract them using type classes pleasant prototyping ISA semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Derivation of Abstract Semantics From Instruction Set Descriptions

Abstracted semantics of instructions of processor-based architectures are an invaluable asset for several formal verification techniques, such as software model checking and static analysis. In the field of model checking, abstract versions of instructions can help counter the state explosion problem, for instance by replacing explicit values by symbolic representations of sets of values. Simil...

متن کامل

Datalog: Bag Semantics via Set Semantics

Duplicates in data management are common and problematic. In this work, we present a translation of Datalog under bag semantics into a well-behaved extension of Datalog (the so-called warded Datalog) under set semantics. From a theoretical point of view, this allows us to reason on bag semantics by making use of the well-established theoretical foundations of set semantics. From a practical poi...

متن کامل

Monads for natural language semantics

Accounts of semantic phenomena often involve extending types of meanings and revising composition rules at the same time. The concept of monads allows many such accounts—for intensionality, variable binding, quantification and focus—to be stated uniformly and compositionally.

متن کامل

DPO rewriting and abstract semantics via opfibrations

The classical DPO graph rewriting construction is re-expressed using the oppbration approach introduced originally for term graph rewriting. Using a skeleton category of graphs, a base of canonical graphs-in-context, with DPO rules as arrows, and with categories of redexes over each object in the base, yields a category of rewrites via the discrete Grothendieck construction. The various possibl...

متن کامل

Instruction set compiled simulation: a technique for fast and flexible instruction set simulation - Design Automation Conference, 2003. Proceedings

Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-market pressure, performance is the most important feature of an instruction-set simulator. Interpretive simulators are flexible but slow, whereas compiled simulators deliver speed at the cost of flexibility. This paper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2023

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3607833